Using Metaheuristic Algorithms Combined with Clustering Approach to Solve a Sustainable Waste Collection Problem

نویسندگان

  • Hamed Farrokhi-Asl School of Industrial Engineering, Iran University of Science & Technology, Tehran, Iran
  • Masoud Rabbani School of Industrial Engineering, College of Engineering, University of Tehran
چکیده مقاله:

Sustainability is a monumental issue that should be considered in designing a logistics system. In order to incorporate sustainability concepts in our study, a waste collection problem with economic, environmental, and social objective functions was addressed. The first objective function minimized overall costs of the system, including establishment of depots and treatment facilities. Addressing environmental concerns, greenhouse gases emission was minimized by the second objective function and the third one maximized distances between each customer and treatment facilities. Treatment facility is noxious for human health and should be located in the maximum distance from the urban area. Initially, the locations of depots and treatment facilities were determined. Then, heterogeneous vehicles started to collect waste from the location of each customer and take it to treatment facilities. The problem included two types of open and close routes. Moreover, each vehicle had a capacity restriction, servicing time, and route length. There were different types of waste and each vehicle had a different capacity for them. Three metaheuristic algorithms combined with clustering approach were proposed to look for the best solutions in rational time. The Non-dominated Sorting Genetic Algorithm-II (NSGA-II), improved Strength Pareto Evolutionary Algorithm (SPEA-II), and Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D) were compared in terms of performance metrics. According to the results, NSGA-II outweighed other algorithms in the presented model.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving a bi-objective location routing problem by a NSGA-II combined with clustering approach: application in waste collection problem

It is observed that the separated design of location for depots and routing for servicing customers often reach a suboptimal solution. So, solving location and routing problem simultaneously could achieve better results. In this paper, waste collection problem is considered with regard to economic and societal objective functions. A non-dominated sorting genetic algorithm (NSGA-II) is used to l...

متن کامل

Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands

Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands Abstract In this paper, the capacitated location routing problem with fuzzy demands (CLRP_FD) is considered. In CLRP_FD, facility location problem (FLP) and vehicle routing problem (VRP) are observed simultaneously. Indeed the vehicles and the depots have a predefined capacity to serve the customerst...

متن کامل

A hybrid metaheuristic algorithm for solving a rollon–rolloff waste collection vehicle routing problem considering waste separation and recycling center

This paper addresses a rollon–rolloff waste collection vehicle routing problem which involves large containers that collect huge amounts of waste from construction sites and shopping malls. In this problem, vehicles could only move one container at a time between customers’ locations, a depot, a disposal center, and a recycling center site. Other than a disposal center, a recycling ...

متن کامل

Gene Clustering Using Metaheuristic Optimization Algorithms

Gene clustering is a familiar step in the exploratory analysis of high dimensional biological data. It is the process of grouping genes of similar patterns in the same cluster and aims at analyzing the functions of gene that leads to the development of drugs and early diagnosis of diseases. In the recent years, much research has been proposed using nature inspired meta-heuristic algorithms. Cuc...

متن کامل

A Survey of Various Metaheuristic Algorithms Used to Solve VLSI Floorplanning Problem

---------------------------------------------------------------------***--------------------------------------------------------------------Abstract Floorplanning is an important problem in very large scale integrated-circuit (VLSI) design automation as it determines the performance, size, yield, and reliability of VLSI chips. From the computational point of view, VLSI floorplanning is an NP-ha...

متن کامل

METAHEURISTIC ALGORITHMS FOR MINIMUM CROSSING NUMBER PROBLEM

This paper presents the application of metaheuristic methods to the minimum crossing number problem for the first time. These algorithms including particle swarm optimization, improved ray optimization, colliding bodies optimization and enhanced colliding bodies optimization. For each method, a pseudo code is provided. The crossing number problem is NP-hard and has important applications in eng...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 4  شماره 1

صفحات  153- 174

تاریخ انتشار 2019-06-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023